Framework for negotiation in Distributed Nurse Rostering Problems

نویسندگان

  • Stefaan Haspeslagh
  • Patrick De Causmaecker
  • Greet Vanden Berghe
چکیده

This contribution deals with the distributed version of the nurse rostering problem. It is considered in a hospital with many separated wards. The nurse rostering problem within a ward is ‘the local problem’, rosters within a ward are ‘local rosters’. At any time in the process, i.e. at the time of the construction of a roster for a certain time period as well as in the course of this time period when unexpected events cause rescheduling, wards may call in the help of their peers. At this level negotiation will take place. The details of the local rosters do not necessarily enter this negotiation level, and when they do, they may be translated from a local representation to a generally accepted vocabulary. After a motivation for a distributed approach, a general architecture is proposed and a negotiation protocol is described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negotiation Protocols for Distributed Nurse Rostering

One intricate computational problem still researched today is the Nurse Rostering Problem. Most literature presents different solutions to the local problem, but in recent years the concept of problem decomposition was identified as one way to improve performance. The downside of this is that the quality of separate rosters is much lower than that of a central solution, where personnel can be s...

متن کامل

Nurse rostering using fuzzy logic: A case study

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

متن کامل

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

Memetic Algorithms for Nurse Rostering

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic...

متن کامل

A Hybrid Approach for Solving Real-World Nurse Rostering Problems

Nurse rostering is the process of creating a plan for nurse working hours over a given time horizon. This problem, most variants of which are NP-hard, has been studied extensively for many years. Still, practical nurse rostering is mostly done manually, often by highly qualified health care personnel. This underlines the need to address the challenges of realistic, applied nurse rostering, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006